Parallel processing of natural language parsers
نویسنده
چکیده
In this paper we describe an implementation of a parallel parser for natural language. We first indicate why these applications are typically hard to parallelize. We then present a work stealing approach for symmetric shared-memory multiprocessors that minimizes overhead by dynamically controlling the granularity of work distribution. In addition, we will explain how we deal with concurrent access of the centralized chart.
منابع مشابه
A General Method for Transforming Standard Parsers into Error-Repair Parsers
A desirable property for any system dealing with unrestricted natural language text is robustness, the ability to analyze any input regardless of its grammaticality. In this paper we present a novel, general transformation technique to automatically obtain robust, error-repair parsers from standard non-robust parsers. The resulting error-repair parsing schema is guaranteed to be correct when ou...
متن کاملWorkshop Notes of the ECML / MLnet Workshop on Empirical Learning of Natural Language Processing Tasks
This paper presents a method for learning eecient parsers of natural language. The method consists of an Explanation-Based Learning (EBL) algorithm for learning partial-parsers, and a parsing algorithm which combines partial-parsers with existing \full-parsers". The learned partial-parsers, implementable as Cascades of Finite State Transducers (CFSTs), recognize and combine constituents eecient...
متن کاملNetworks of Evolutionary Processors as Natural Language Parsers
Networks of Evolutionary Processors (NEPs) –introduced in Castellanos et al. (2001)– are a new computing mechanism directly inspired from the behavior of cell populations. In the paper, we we explore the possibility of Networks of Evolutionary Processors (NEPs) to be suitable for modelling natural language – an entity generated in parallel by a modular architecture – and specially syntax – a mo...
متن کاملMethods for Parallelizing Search Paths in Parsing
Many search problems are commonly solved with simple combinatoric algorithms that unnecessarily duplicate and serialize work at considerable computational expense. There are a number of techniques available that can eliminate redundant computations and perform remaining operations in parallel, effectively reducing the branching factors of these algorithms. This thesis investigates the applicati...
متن کاملLearning Semantic Parsers for Natural Language Understanding
For building question answering systems and natural language interfaces, semantic parsing has emerged as an important and powerful paradigm. Semantic parsers map natural language into logical forms, the classic representation for many important linguistic phenomena. The modern twist is that we are interested in learning semantic parsers from data, which introduces a new layer of statistical and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999